An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections

نویسندگان

  • Waldemar W. Koczkodaj
  • Marian Orlowski
چکیده

The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comaprisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is the required consistent approximation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

Extracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method

In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...

متن کامل

Iterative algorithm for the generalized ‎$‎(P‎,‎Q)‎$‎-reflexive solution of a‎ ‎quaternion matrix equation with ‎$‎j‎$‎-conjugate of the unknowns

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

متن کامل

Determination of weight vector by using a pairwise comparison matrix based on DEA and Shannon entropy

The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...

متن کامل

On the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint

This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1505.01903  شماره 

صفحات  -

تاریخ انتشار 2015